Nonnegative Morse polynomial functions and polynomial optimization
نویسندگان
چکیده
منابع مشابه
Optimization of Polynomial Functions
Recently progress has been made in the development of algorithms for optimizing polynomials. The main idea being stressed is that of reducing the problem to an easier problem involving semidefinite programming [18]. It seems that in many cases the method dramatically outperforms other existing methods. The idea traces back to work of Shor [16][17] and is further developed by Parrilo [10] and by...
متن کاملPiecewise Polynomial Reconstruction of Functions from Simplified Morse-Smale complex
Simulation of phenomena like climate often deals with large datasets. A process to extract the most salient features is needed to assist in the understanding of the dataset. The Morse-Smale (MS) complex is a topological structure defined on scalar functions which extracts critical points of the function and the links between them. Furthermore, it encodes a hierarchy between critical points, and...
متن کاملGlobal Optimization of Polynomial Functions and Applications
Global Optimization of Polynomial Functions and Applications by Jiawang Nie Doctor of Philosophy in Applied Mathematics University of California, Berkeley Professor James Demmel, Co-Chair Professor Bernd Sturmfels, Co-Chair This thesis discusses the global optimization problem whose objective function and constraints are all described by (multivariate) polynomials. The motivation is to find the...
متن کاملAn Extremal Nonnegative Sine Polynomial
For any positive integer n, the sine polynomials that are nonnegative in [0, π] and which have the maximal derivative at the origin are determined in an explicit form. Associated cosine polynomials Kn(θ) are constructed in such a way that {Kn(θ)} is a summability kernel. Thus, for each p, 1 ≤ p ≤ ∞ and for any 2π-periodic function f ∈ Lp[−π, π], the sequence of convolutions Kn ∗ f is proved to ...
متن کاملCoupled systems of equations with entire and polynomial functions
We consider the coupled system$F(x,y)=G(x,y)=0$,where$$F(x, y)=bs 0 {m_1} A_k(y)x^{m_1-k}mbox{ and } G(x, y)=bs 0 {m_2} B_k(y)x^{m_2-k}$$with entire functions $A_k(y), B_k(y)$.We derive a priory estimates for the sums of the rootsof the considered system andfor the counting function of roots.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Positivity
سال: 2015
ISSN: 1385-1292,1572-9281
DOI: 10.1007/s11117-015-0367-z